A Study of Quantum Information and Quantum Computers
نویسندگان
چکیده
منابع مشابه
Quantum Walks, Quantum Gates, and Quantum Computers
The physics of quantum walks on graphs is formulated in Hamiltonian language, both for simple quantum walks and for composite walks, where extra discrete degrees of freedom live at each node of the graph. It is shown how to map between quantum walk Hamiltonians and Hamiltonians for qubit systems and quantum circuits; this is done for both a singleand multi-excitation coding, and for more genera...
متن کاملQuantum computers and quantum coherence
If the states of spins in solids can be created, manipulated, and measured at the single-quantum level, an entirely new form of information processing, quantum computing, will be possible. We "rst give an overview of quantum information processing, showing that the famous Shor speedup of integer factoring is just one of a host of important applications for qubits, including cryptography, counte...
متن کاملDUALITY QUANTUM COMPUTERS and QUANTUM OPERATIONS
We present a mathematical theory for a new type of quantum computer called a duality quantum computer that has recently been proposed. We discuss the nonunitarity of certain circuits of a duality quantum computer. It is shown that a duality quantum computer can measure itself without needing a separate measurement apparatus to determine its final state. We then discuss the relevance of this wor...
متن کاملIntroduction to Quantum Computers and Quantum Algorithms
This is a short introduction to Quantum Computing intended for physicists. The basic idea of a quantum computer is introduced. Then we concentrate on Shor’s integer factoring algorithm. 1 What is a Quantum Computer? In this first lesson I want to introduce the basics necessary to understand quantum algorithms: What a quantum computer is, quantum gates and how to do usual computations on a quant...
متن کاملQuantum Computers
We analyse dissipation in quantum computation and its destructive impact on eeciency of quantum algorithms. We discuss relations between decoherence and computational complexity and show that quantum factorisation algorithm must be modiied in order to be regarded as eecient and realistic. Our model od decoherence is quite general and incorporates reservoirs with a large coherence length.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Oriental Journal of Chemistry
سال: 2014
ISSN: 0970-020X,2231-5039
DOI: 10.13005/ojc/300227